Fair and Interpretable Algorithmic Hiring using Evolutionary Many Objective Optimization

نویسندگان

چکیده

Hiring is a high-stakes decision-making process that balances the joint objectives of being fair and accurately selecting top candidates. The industry standard method employs subject-matter experts to manually generate hiring algorithms; however, this resource intensive finds sub-optimal solutions. Despite recognized need for algorithmic solutions address these limitations, no reported currently supports optimizing predictive while complying legal fairness standards. We present novel application Evolutionary Many-Objective Optimization (EMOO) methods create first fair, interpretable, legally compliant approach. Using proposed Dirichlet-based genetic operators improved search, we compare state-of-the-art EMOO models (NSGA-III, SPEA2-SDE, bi-goal evolution) expert solutions, verifying our results across three real world datasets diverse organizational positions. Experimental demonstrate outperform human experts, consistently fairer algorithms, can provide additional lift when removing constraints required analysis.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive -Ranking and Distribution Search on Evolutionary Many-objective Optimization

In this work, we study the effectiveness of Adaptive -Ranking for distribution search in the context of many-objective optimization. Adaptive -Ranking re-classifies sets of non-dominated solutions using iteratively a randomized sampling procedure that applies -dominance with a mapping function f(x) 7→ f (x) to bias selection towards the distribution of solutions implicit in the mapping. We anal...

متن کامل

Many-Objective Evolutionary Optimisation

Many-objective evolutionary optimisation is a recent research area that is concerned with the optimisation of problems consisting of a large number of performance criteria using evolutionary algorithms. Despite the tremendous development that multi-objective evolutionary algorithms (MOEAs) have undergone over the last decade, studies addressing problems consisting of a large number of objective...

متن کامل

A New Evolutionary Decision Theory for Many-Objective Optimization Problems

In this paper the authors point out that the Pareto Optimality is unfair, unreasonable and imperfect for Many-objective Optimization Problems (MOPs) underlying the hypothesis that all objectives have equal importance. The key contribution of this paper is the discovery of the new definition of optimality called ε-optimality for MOP that is based on a new conception, so called ε-dominance, which...

متن کامل

Preference-guided evolutionary algorithms for many-objective optimization

This paper presents a technique that incorporates preference information within the framework of multi-objective evolutionary algorithms for the solution of many-objective optimization problems. The proposed approach employs a single reference point to express the preferences of a decision maker, and adaptively biases the search procedure toward the region of the Pareto-optimal front that best ...

متن کامل

Evolutionary Many-Objective Optimization Based on Kuhn-Munkres' Algorithm

In this paper, we propose a new multi-objective evolutionary algorithm (MOEA), which transforms a multi-objective optimization problem into a linear assignment problem using a set of weight vectors uniformly scattered. Our approach adopts uniform design to obtain the set of weights and Kuhn-Munkres’ (Hungarian) algorithm to solve the assignment problem. Differential evolution is used as our sea...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ... AAAI Conference on Artificial Intelligence

سال: 2021

ISSN: ['2159-5399', '2374-3468']

DOI: https://doi.org/10.1609/aaai.v35i17.17737